Hyper-minimisation of deterministic weighted finite automata over semifields
نویسندگان
چکیده
Hyper-minimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal power series to differ for finitely many input strings. First, the structure of hyper-minimal deterministic weighted finite automata is characterised in a similar way as in classical weighted minimisation and unweighted hyper-minimisation. Second, an efficient minimisation algorithm, which runs in time O(n logn), is derived from this characterisation.
منابع مشابه
Hyper-minimisation of deterministic weighted nite automata over semi elds
Hyper-minimisation of deterministic nite automata is a recently introduced state reduction technique that allows a nite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semi elds is presented, which allows the recognised formal power series to di er for nitely many input strings. First, the structure of hyper-minimal deterministic...
متن کاملHyper-Minimization for Deterministic Weighted Tree Automata
Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided. The presence of weights slightly complicates the situation in comparison to the unweighted case. In addition, the first hyper-minimization algorithm for deterministic weighted tree automata, weighted over commutati...
متن کاملBeyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata i...
متن کاملMinimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata ...
متن کامل